منابع مشابه
Some Geometric Lower Bounds
Dobkin and Lipton introduced the connected components argument to prove lower bounds in the linear decision tree model for membership problems, for example the element uniqueness problem. In this paper we apply the same idea to obtain lower bound statements for a variety of problems, each having the avor of element uniqueness. In fact one of these problems is a parametric version of element uni...
متن کاملNew lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملSome Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show Ω(n log n) time lower bounds for separability by means of strips, wedges, wedges with apices on a given line, fixed-slopes double wedges, and triangles, which match the complexity of the existing algorithms, and therefore prove their optimality.
متن کاملConstructive Lower Bounds on Classical Multicolor Ramsey Numbers
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results, and then by presenting several general constructions establishing new lower bounds for many diagonal and off-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for Rk(4) and Rk(5) for some small k, including 415 ≤ R3(5), 634 ≤ R4(4), 2721 ≤ R...
متن کاملOn the Lower Bounds of Ramsey Numbers of Knots
The Ramsey number is known for only a few specific knots and links, namely the Hopf link and the trefoil knot (although not published in periodicals). We establish the lower bound of all Ramsey numbers of any knot to be one greater than its stick number. 1 Background and Definitions The study of Ramsey numbers of knots can be found at the intersection of knot theory and graph theory. 1.1 Knot T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2014
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140963716